Recursive Code Construction for Random Networks
نویسندگان
چکیده
منابع مشابه
Code Construction for Two-Source Interference Networks
Most literature on network coding focuses on the multicast case where performance bounds and codes that achieve these bounds were found. The general case seems to be much more complicated to analyze. Koetter and Médard [1] gave an algebraic formulation of linear network codes in the general communication problem with multiple sources. However, the complexity of finding the coding coefficients o...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملRecursive Construction of Periodic Steady State for Neural Networks
We present a strategy in order to build neural networks with long steady-state periodic behavior. This strategy allows us to obtain 2” nonequivalent neural networks of size n, when the equivalence relation is the usual one in dynamical systems. As a particular case, we build a neural network with n neurons which realizes a cycle of period 2”.
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملDistributed Construction of Random Expander Networks
We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globally-known server is required. The constructed topologies are expanders with O(logd n) diameter with high probability. Our construction is highly scalable because both the processing and the space requirements at each node g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2009.2039163